An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems

نویسندگان

  • Gail W. DePuy
  • Martin W. P. Savelsbergh
  • Jane C. Ammons
  • Leon F. McGinnis
چکیده

Component allocation is an important element of process planning for printed circuit card assembly systems. The component allocation problem directly impacts the productivity and cost of a circuit card assembly system. Many companies have recognized the importance of component allocation and have started to develop a better decision process. Also, a few commercial software packages have been developed that provide environments to support process planning. However, optimization methods are not yet widely used. We demonstrate that component allocation is amenable to improvement using optimization methods. We present an integer programming heuristic for the component allocation problem and report on several case studies that have been conducted and that demonstrate its effectiveness. The heuristic is based on a mixed integer programming formulation of the component allocation problem that incorporates estimates of downstream process planning decisions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedures

The problem of grouping Printed Circuit Board (PCB) components to minimize the total component and PCB loading cost subject to a capacity constraint on the number of types of components per group is formulated as an integer linear programming problem. The problem is shown to be NP-complete. Characteristics of the solution are outlined and a heuristic algorithm is discussed. For the case in whic...

متن کامل

A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence opt...

متن کامل

Bi-objective Scheduling in Printed Circuit Board Assembly

This paper presents an approach to solve the problem of scheduling printed circuit board assemblies on single production line to minimize total weighted tardiness and total feeder setups, which are sequence dependent. Preemptive integer goal programming model is constructed to represent the bi-objective problem. Although an optimal branch-and-bound method is available, its computational require...

متن کامل

Integer Programming Approach to Printed Circuit Board Assembly Time Optimization

A printed circuit board (PCB) assembly task requires that a set of components be picked from their respective pickup locations and then be placed at their respective placement locations on the card being assembled. A pick-and-place robot is used for automated assembly of PCB’s. The overall assembly time depends on two different decision variables (i) the pickup locations of the components (in g...

متن کامل

Setup Optimization in High-Mix Surface Mount PCB Assembly Setup Optimization in High-Mix Surface Mount PCB Assembly

The thesis discusses machine setup problems which arise in high-mix, lowvolume production environments of printed circuit board assembly (PCB) industry. We concentrate especially on the hybrid setup problem that is a combination of the job grouping and minimum setup problems. We define an objective function that minimizes a weighted sum of the number of setup occasions and the number of feeder ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Heuristics

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2001